d={}
a=int(input())
l=list(map(int,input().split()))
x=0
for i in l:
if i not in d:
d[i]=1
else:
d[i]+=1
if d[i]>x:
x=d[i]
print(x)#include <bits/stdc++.h>
using namespace std;
int ans; map <int, int> mp;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n; cin >> n;
for (int i = 0; i < n; i++) {
int a; cin >> a;
mp[a]++;
}
for (auto i = mp.begin(); i != mp.end() ; i++) {
ans = max(i->second, ans);
}
cout << ans;
}1173B - Nauuo and Chess | 318B - Strings of Power |
1625A - Ancient Civilization | 864A - Fair Game |
1663B - Mike's Sequence | 448A - Rewards |
1622A - Construct a Rectangle | 1620A - Equal or Not Equal |
1517A - Sum of 2050 | 620A - Professor GukiZ's Robot |
1342A - Road To Zero | 1520A - Do Not Be Distracted |
352A - Jeff and Digits | 1327A - Sum of Odd Integers |
1276A - As Simple as One and Two | 812C - Sagheer and Nubian Market |
272A - Dima and Friends | 1352C - K-th Not Divisible by n |
545C - Woodcutters | 1528B - Kavi on Pairing Duty |
339B - Xenia and Ringroad | 189A - Cut Ribbon |
1182A - Filling Shapes | 82A - Double Cola |
45A - Codecraft III | 1242A - Tile Painting |
1663E - Are You Safe | 1663D - Is it rated - 3 |
1311A - Add Odd or Subtract Even | 977F - Consecutive Subsequence |